Instability analysis of saddle points by a local minimax method
نویسنده
چکیده
The objective of this work is to develop some tools for local instability analysis of multiple critical points, which can be computationally carried out. The Morse index can be used to measure local instability of a nondegenerate saddle point. However, it is very expensive to compute numerically and is ineffective for degenerate critical points. A local (weak) linking index can also be defined to measure local instability of a (degenerate) saddle point. But it is still too difficult to compute. In this paper, a local instability index, called a local minimax index, is defined by using a local minimax method. This new instability index is known beforehand and can help in finding a saddle point numerically. Relations between the local minimax index and other local instability indices are established. Those relations also provide ways to numerically compute the Morse, local linking indices. In particular, the local minimax index can be used to define a local instability index of a saddle point relative to a reference (trivial) critical point even in a Banach space while others failed to do so.
منابع مشابه
Convergence Results of A Minimax Method for Finding Multiple Critical Points
In [12], new local minimax theorems which characterize a saddle point as a solution to a two-level local minimax problem are established. Based on the local characterization, a numerical minimax method is designed for finding multiple saddle points. Many numerical examples in semilinear elliptic PDE have been successfully carried out to solve for multiple solutions. One of the important issues ...
متن کاملA Local Minimax-Newton Method for Finding Multiple Saddle Points with Symmetries
In this paper, a local minimax-Newton method is developed to solve for multiple saddle points. The local minimax method [15] is used to locate an initial guess and a version of the generalized Newton method is used to speed up convergence. When a problem possesses a symmetry, the local minimax method is invariant to the symmetry. Thus the symmetry can be used to greatly enhance the efficiency a...
متن کاملConvergence Results of a Local Minimax Method for Finding Multiple Critical Points
In [14], a new local minimax method that characterizes a saddle point as a solution to a local minimax problem is established. Based on the local characterization, a numerical minimax algorithm is designed for finding multiple saddle points. Numerical computations of many examples in semilinear elliptic PDE have been successfully carried out to solve for multiple solutions. One of the important...
متن کاملA Minimax Method for Finding Multiple Critical Points and Its Applications to Semilinear PDEs
Most minimax theorems in critical point theory require to solve a two-level global optimization problem and therefore are not for algorithm implementation. The objective of this research is to develop numerical algorithms and corresponding mathematical theory for finding multiple saddle points in a stable way. In this paper, inspired by the numerical works of Choi-McKenna and Ding-Costa-Chen, a...
متن کاملComputational Theory and Methods for Finding Multiple Critical Points
Let H be a Hilbert space and J ∈ C(H, ). Denote δJ its Frechet derivative and J ′ its gradient. The objective of this research is to develop computational theory and methods for finding multiple critical points, i.e., solutions to the Euler-Lagrange equation J (u) = 0. A critical point u is nondegenerate if J (u) is invertible. Otherwise u is degenerate. The first candidates for a critical poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 74 شماره
صفحات -
تاریخ انتشار 2005